NON-EQUIVALENT GREEDY AND ALMOST GREEDY BASES IN `p
نویسندگان
چکیده
For 1 < p < ∞ and p 6= 2 we construct a family of mutually non-equivalent greedy bases in `p having the cardinality of the continuum. In fact, no basis from this family is equivalent to a rearranged subsequence of any other basis thereof. We are able to extend this statement to the spaces Lp and H1. Moreover, the technique used in the proof adapts to the setting of almost greedy bases where similar results are obtained.
منابع مشابه
N ov 2 00 6 AN EXAMPLE OF AN ALMOST GREEDY UNIFORMLY BOUNDED ORTHONORMAL
We construct a uniformly bounded orthonormal almost greedy basis for L p ([0, 1]), 1 < p < ∞. The example shows that it is not possible to extend Orlicz's theorem, stating that there are no uniformly bounded orthonormal unconditional bases for L p ([0, 1]), p = 2, to the class of almost greedy bases.
متن کاملOn the Existence of Almost Greedy Bases in Banach Spaces
We consider several greedy conditions for bases in Banach spaces that arise naturally in the study of the Thresholding Greedy Algorithm (TGA). In particular, we continue the study of almost greedy bases begun in [3]. We show that almost greedy bases are essentially optimal for n-term approximation when the TGA is modified to include a Chebyshev approximation. We prove that if a Banach space X h...
متن کاملComments on the Paper ’on the Existence of Almost Greedy Bases in Banach Spaces’ By
Greedy algorithms are widely used in image processing and other applications. Let X be a real Banach space with a semi-normalized basis (en). An algorithm for n-term approximation produces a sequence of maps Fn : X → X such that, for each x ∈ X, Fn(x) is a linear combination of at most n of the basis elements (ej). Konyagin and Temlyakov [12] introduced the Thresholding Greedy Algorithm (TGA) (...
متن کاملWeak Thresholding Greedy Algorithms in Banach Spaces
We consider weak thresholding greedy algorithms with respect to Markushevich bases in general Banach spaces. We find sufficient conditions for the equivalence of boundedness and convergence of the approximants. We also show that if there is a weak thresholding algorithm for the system which gives the best n-term approximation up to a multiplicative constant, then the system is already “greedy”....
متن کاملSparse approximation and recovery by greedy algorithms in
We study sparse approximation by greedy algorithms. We prove the Lebesgue-type inequalities for the Weak Chebyshev Greedy Algorithm (WCGA), a generalization of the Weak Orthogonal Matching Pursuit to the case of a Banach space. The main novelty of these results is a Banach space setting instead of a Hilbert space setting. The results are proved for redundant dictionaries satisfying certain cond...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006